Semirigorous synchronous sublattice algorithm for parallel kinetic Monte Carlo simulations of thin film growth

نویسنده

  • Jacques G. Amar
چکیده

The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin film growth. However, in some cases it is necessary to study systems over extended time and length scales, and therefore a parallel algorithm is desired. Here we describe an efficient, semirigorous synchronous sublattice algorithm for parallel kinetic Monte Carlo simulations. The accuracy and parallel efficiency are studied as a function of diffusion rate, processor size, and number of processors for a variety of simple models of epitaxial growth. The effects of fluctuations on the parallel efficiency are also studied. Since only local communications are required, linear scaling behavior is observed, e.g., the parallel efficiency is independent of the number of processors for fixed processor size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recent advances in parallel kinetic Monte Carlo: synchronous sublattice algorithm

Abstract. An efficient, semi-rigorous synchronous algorithm for parallel kinetic Monte Carlo simulations is presented. The accuracy and parallel efficiency are studied as a function of processor size, number of processors, and the ratio D/F of monomer hopping rate (D) to deposition rate (F ) for two different simple models of epitaxial growth. Since only local communication is required, the alg...

متن کامل

Synchronous relaxation algorithm for parallel kinetic Monte Carlo simulations of thin film growth.

We present an optimistic synchronous relaxation algorithm for parallel kinetic Monte Carlo (KMC) simulations of thin film growth. This algorithm is based on spatial decomposition of the KMC lattice and it employs two measures aimed at improving the parallel efficiency: dynamic global updating and domain boundary shifting. We utilize this algorithm to simulate two different growth models, which ...

متن کامل

Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth

We have generalized and implemented the hybrid asynchronous algorithm, originally proposed for parallel simulations of the spin-flip Ising model, in order to carry out parallel kinetic Monte Carlo (KMC) simulations. The parallel performance has been tested using a simple model of thin-film growth in both 1D and 2D. We also briefly describe how the data collection must be modified as compared to...

متن کامل

Billion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems

An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez et al [J. Comp. Phys. 227 (2008) 3804] to discrete lattices is presented. The method solves the master equation synchronously by recourse to null events that keep all processors time clocks current in a global sense. Boundary conflicts are rigorously solved by adopting a chessboard decomposition ...

متن کامل

Reduction Strategies for Kinetic Monte Carlo Models of Thin Film Growth

Thin film deposition encompasses a variety of physical processes, which occur over a wide range of length and time scales. A major challenge in modeling and simulating thin film deposition is this disparity in scales. In this study we focus on an atomic-scale lattice model of surface processes. Kinetic Monte Carlo simulations provide stochastic realizations of the surface evolution, which may t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005